An efficient quantum scheme for Private Set Intersection

نویسندگان

  • Runhua Shi
  • Yi Mu
  • Hong Zhong
  • Jie Cui
  • Shun Zhang
چکیده

Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Disciplines Engineering | Science and Technology Studies Publication Details Shi, R., Mu, Y., Zhong, H., Cui, J. & Zhang, S. (2016). An efficient quantum scheme for Private Set Intersection. Quantum Information Processing, 15 (1), 363-371. This journal article is available at Research Online: http://ro.uow.edu.au/eispapers/4985 An Efficient Quantum Scheme for Private Set Intersection Run-hua Shi Yi Mu Hong Zhong Jie Cui Shun Zhang 1. School of Computer Science and Technology, Anhui University, Hefei City, 230601, China 2. Centre for Computer and Information Security Research, School of Computing and Information Technology, University of Wollongong, Wollongong NSW 2522, Australia (Emails: [email protected], [email protected], [email protected], [email protected], [email protected]) Abstract. Private set intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multi-party collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for private set intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server’s set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks. Private set intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multi-party collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for private set intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server’s set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets (Extended Version)

In recent years, determining the common information privately and efficiently between two mutually mistrusting parties have become an important issue in social networks. Many Private set intersection (PSI) protocols have been introduced to address this issue. By applying these protocols, two parties can compute the intersection between their sets without disclosing any information about compone...

متن کامل

GUC-Secure Set-Intersection Computation

Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party set-intersection computation based-on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. Compared with related works, this construction is provably GUC(generalized un...

متن کامل

Efficient Private Proximity Testing with GSM Location Sketches

A protocol for private proximity testing allows two mobile users communicating through an untrusted third party to test whether they are in close physical proximity without revealing any additional information about their locations. At NDSS 2011, Narayanan and others introduced the use of unpredictable sets of “location tags” to secure these schemes against attacks based on guessing another use...

متن کامل

Private and threshold set-intersection

In this paper we consider the problem of privately computing the intersection of sets (setintersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual threshold set. In threshold ...

متن کامل

Private and Threshold Set-Intersection

In this paper we consider the problem of privately computing the set-intersection (private matching) of sets, as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual set. In threshold set-i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information Processing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2016